TSTP Solution File: SEV088^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV088^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n032.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:18 EDT 2024
% Result : Theorem 0.16s 0.32s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SEV088^5 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Fri May 3 12:12:39 EDT 2024
% 0.11/0.30 % CPUTime :
% 0.11/0.30 This is a TH0_THM_NEQ_NAR problem
% 0.11/0.30 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.exKh5hQAAD/Vampire---4.8_7491
% 0.16/0.32 % (7728)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (3000ds/183Mi)
% 0.16/0.32 % (7733)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (3000ds/275Mi)
% 0.16/0.32 % (7729)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (3000ds/4Mi)
% 0.16/0.32 % (7732)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (3000ds/2Mi)
% 0.16/0.32 % (7733)First to succeed.
% 0.16/0.32 % (7732)Instruction limit reached!
% 0.16/0.32 % (7732)------------------------------
% 0.16/0.32 % (7732)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32 % (7732)Termination reason: Unknown
% 0.16/0.32 % (7732)Termination phase: Saturation
% 0.16/0.32
% 0.16/0.32 % (7734)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (3000ds/18Mi)
% 0.16/0.32 % (7732)Memory used [KB]: 5500
% 0.16/0.32 % (7732)Time elapsed: 0.003 s
% 0.16/0.32 % (7732)Instructions burned: 3 (million)
% 0.16/0.32 % (7732)------------------------------
% 0.16/0.32 % (7732)------------------------------
% 0.16/0.32 % (7733)Refutation found. Thanks to Tanya!
% 0.16/0.32 % SZS status Theorem for Vampire---4
% 0.16/0.32 % SZS output start Proof for Vampire---4
% 0.16/0.32 thf(func_def_3, type, sK0: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i > $o).
% 0.16/0.32 thf(func_def_4, type, sK1: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i > $o).
% 0.16/0.32 thf(func_def_5, type, sK2: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i > $o).
% 0.16/0.32 thf(func_def_6, type, sK3: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i).
% 0.16/0.32 thf(func_def_7, type, sK4: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i).
% 0.16/0.32 thf(func_def_8, type, sK5: (($i > $o) > ($i > $o) > $i > $o) > (($i > $o) > ($i > $o) > $i > $o) > $i > $o).
% 0.16/0.32 thf(func_def_10, type, ph7: !>[X0: $tType]:(X0)).
% 0.16/0.32 thf(f32,plain,(
% 0.16/0.32 $false),
% 0.16/0.32 inference(trivial_inequality_removal,[],[f31])).
% 0.16/0.32 thf(f31,plain,(
% 0.16/0.32 ($true != $true)),
% 0.16/0.32 inference(duplicate_literal_removal,[],[f30])).
% 0.16/0.32 thf(f30,plain,(
% 0.16/0.32 ($true != $true) | ($true != $true)),
% 0.16/0.32 inference(beta_eta_normalization,[],[f23])).
% 0.16/0.32 thf(f23,plain,(
% 0.16/0.32 ( ! [X0 : ($i > $o) > ($i > $o) > $i > $o] : (($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ X0) @ (sK5 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ X0) @ (sK4 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ X0))) | ($true != ((^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ (sK1 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ X0) @ (sK2 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ X0) @ (sK3 @ (^[Y0 : $i > $o]: ((^[Y1 : $i > $o]: ((^[Y2 : $i]: ($true)))))) @ X0)))) )),
% 0.16/0.32 inference(primitive_instantiation,[],[f17])).
% 0.16/0.32 thf(f17,plain,(
% 0.16/0.32 ( ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (($true != (X1 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0))) | ($true != (X1 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ (sK3 @ X1 @ X0)))) )),
% 0.16/0.32 inference(cnf_transformation,[],[f12])).
% 0.16/0.32 thf(f12,plain,(
% 0.16/0.32 ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (((($true != (X0 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ (sK3 @ X1 @ X0))) & ($true != (X1 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ (sK3 @ X1 @ X0)))) & ! [X6] : (($true = (X0 @ (sK1 @ X1 @ X0) @ (sK0 @ X1 @ X0) @ X6)) | ((X1 @ (sK1 @ X1 @ X0) @ (sK0 @ X1 @ X0) @ X6) = $true)) & ! [X7] : (($true = (X0 @ (sK0 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X7)) | ((X1 @ (sK0 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X7) = $true))) | (($true != (X0 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0))) & ($true != (X1 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0)))))),
% 0.16/0.32 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f8,f11,f10,f9])).
% 0.16/0.32 thf(f9,plain,(
% 0.16/0.32 ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X2 : $i > $o,X3 : $i > $o,X4 : $i > $o] : (? [X5] : (((X0 @ X3 @ X4 @ X5) != $true) & ((X1 @ X3 @ X4 @ X5) != $true)) & ! [X6] : (((X0 @ X3 @ X2 @ X6) = $true) | ((X1 @ X3 @ X2 @ X6) = $true)) & ! [X7] : (((X0 @ X2 @ X4 @ X7) = $true) | ($true = (X1 @ X2 @ X4 @ X7)))) => (? [X5] : (($true != (X0 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X5)) & ($true != (X1 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X5))) & ! [X6] : (($true = (X0 @ (sK1 @ X1 @ X0) @ (sK0 @ X1 @ X0) @ X6)) | ((X1 @ (sK1 @ X1 @ X0) @ (sK0 @ X1 @ X0) @ X6) = $true)) & ! [X7] : (($true = (X0 @ (sK0 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X7)) | ((X1 @ (sK0 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X7) = $true))))),
% 0.16/0.32 introduced(choice_axiom,[])).
% 0.16/0.32 thf(f10,plain,(
% 0.16/0.32 ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X5] : (($true != (X0 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X5)) & ($true != (X1 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ X5))) => (($true != (X0 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ (sK3 @ X1 @ X0))) & ($true != (X1 @ (sK1 @ X1 @ X0) @ (sK2 @ X1 @ X0) @ (sK3 @ X1 @ X0)))))),
% 0.16/0.32 introduced(choice_axiom,[])).
% 0.16/0.32 thf(f11,plain,(
% 0.16/0.32 ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X8,X9 : $i > $o] : (($true != (X0 @ X9 @ X9 @ X8)) & ((X1 @ X9 @ X9 @ X8) != $true)) => (($true != (X0 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0))) & ($true != (X1 @ (sK5 @ X1 @ X0) @ (sK5 @ X1 @ X0) @ (sK4 @ X1 @ X0)))))),
% 0.16/0.32 introduced(choice_axiom,[])).
% 0.16/0.32 thf(f8,plain,(
% 0.16/0.32 ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X2 : $i > $o,X3 : $i > $o,X4 : $i > $o] : (? [X5] : (((X0 @ X3 @ X4 @ X5) != $true) & ((X1 @ X3 @ X4 @ X5) != $true)) & ! [X6] : (((X0 @ X3 @ X2 @ X6) = $true) | ((X1 @ X3 @ X2 @ X6) = $true)) & ! [X7] : (((X0 @ X2 @ X4 @ X7) = $true) | ($true = (X1 @ X2 @ X4 @ X7)))) | ? [X8,X9 : $i > $o] : (($true != (X0 @ X9 @ X9 @ X8)) & ((X1 @ X9 @ X9 @ X8) != $true)))),
% 0.16/0.32 inference(rectify,[],[f7])).
% 0.16/0.32 thf(f7,plain,(
% 0.16/0.32 ! [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (? [X4 : $i > $o,X5 : $i > $o,X6 : $i > $o] : (? [X9] : (($true != (X0 @ X5 @ X6 @ X9)) & ((X1 @ X5 @ X6 @ X9) != $true)) & ! [X7] : (((X0 @ X5 @ X4 @ X7) = $true) | ((X1 @ X5 @ X4 @ X7) = $true)) & ! [X8] : (($true = (X0 @ X4 @ X6 @ X8)) | ((X1 @ X4 @ X6 @ X8) = $true))) | ? [X3,X2 : $i > $o] : (($true != (X0 @ X2 @ X2 @ X3)) & ($true != (X1 @ X2 @ X2 @ X3))))),
% 0.16/0.32 inference(flattening,[],[f6])).
% 0.16/0.32 thf(f6,plain,(
% 0.16/0.32 ! [X1 : ($i > $o) > ($i > $o) > $i > $o,X0 : ($i > $o) > ($i > $o) > $i > $o] : (? [X4 : $i > $o,X5 : $i > $o,X6 : $i > $o] : (? [X9] : (($true != (X0 @ X5 @ X6 @ X9)) & ((X1 @ X5 @ X6 @ X9) != $true)) & (! [X8] : (($true = (X0 @ X4 @ X6 @ X8)) | ((X1 @ X4 @ X6 @ X8) = $true)) & ! [X7] : (((X0 @ X5 @ X4 @ X7) = $true) | ((X1 @ X5 @ X4 @ X7) = $true)))) | ? [X3,X2 : $i > $o] : (($true != (X0 @ X2 @ X2 @ X3)) & ($true != (X1 @ X2 @ X2 @ X3))))),
% 0.16/0.32 inference(ennf_transformation,[],[f5])).
% 0.16/0.32 thf(f5,plain,(
% 0.16/0.32 ~? [X1 : ($i > $o) > ($i > $o) > $i > $o,X0 : ($i > $o) > ($i > $o) > $i > $o] : (! [X4 : $i > $o,X5 : $i > $o,X6 : $i > $o] : ((! [X8] : (($true = (X0 @ X4 @ X6 @ X8)) | ((X1 @ X4 @ X6 @ X8) = $true)) & ! [X7] : (((X0 @ X5 @ X4 @ X7) = $true) | ((X1 @ X5 @ X4 @ X7) = $true))) => ! [X9] : (((X1 @ X5 @ X6 @ X9) = $true) | ($true = (X0 @ X5 @ X6 @ X9)))) & ! [X2 : $i > $o,X3] : (($true = (X0 @ X2 @ X2 @ X3)) | ($true = (X1 @ X2 @ X2 @ X3))))),
% 0.16/0.32 inference(fool_elimination,[],[f4])).
% 0.16/0.32 thf(f4,plain,(
% 0.16/0.32 ~? [X0 : ($i > $o) > ($i > $o) > $i > $o,X1 : ($i > $o) > ($i > $o) > $i > $o] : (! [X2 : $i > $o,X3] : ((X1 @ X2 @ X2 @ X3) | (X0 @ X2 @ X2 @ X3)) & ! [X4 : $i > $o,X5 : $i > $o,X6 : $i > $o] : ((! [X7] : ((X0 @ X5 @ X4 @ X7) | (X1 @ X5 @ X4 @ X7)) & ! [X8] : ((X1 @ X4 @ X6 @ X8) | (X0 @ X4 @ X6 @ X8))) => ! [X9] : ((X1 @ X5 @ X6 @ X9) | (X0 @ X5 @ X6 @ X9))))),
% 0.16/0.32 inference(rectify,[],[f2])).
% 0.16/0.32 thf(f2,negated_conjecture,(
% 0.16/0.32 ~? [X1 : ($i > $o) > ($i > $o) > $i > $o,X0 : ($i > $o) > ($i > $o) > $i > $o] : (! [X2 : $i > $o,X5] : ((X0 @ X2 @ X2 @ X5) | (X1 @ X2 @ X2 @ X5)) & ! [X3 : $i > $o,X2 : $i > $o,X4 : $i > $o] : ((! [X5] : ((X1 @ X2 @ X3 @ X5) | (X0 @ X2 @ X3 @ X5)) & ! [X5] : ((X0 @ X3 @ X4 @ X5) | (X1 @ X3 @ X4 @ X5))) => ! [X5] : ((X0 @ X2 @ X4 @ X5) | (X1 @ X2 @ X4 @ X5))))),
% 0.16/0.32 inference(negated_conjecture,[],[f1])).
% 0.16/0.32 thf(f1,conjecture,(
% 0.16/0.32 ? [X1 : ($i > $o) > ($i > $o) > $i > $o,X0 : ($i > $o) > ($i > $o) > $i > $o] : (! [X2 : $i > $o,X5] : ((X0 @ X2 @ X2 @ X5) | (X1 @ X2 @ X2 @ X5)) & ! [X3 : $i > $o,X2 : $i > $o,X4 : $i > $o] : ((! [X5] : ((X1 @ X2 @ X3 @ X5) | (X0 @ X2 @ X3 @ X5)) & ! [X5] : ((X0 @ X3 @ X4 @ X5) | (X1 @ X3 @ X4 @ X5))) => ! [X5] : ((X0 @ X2 @ X4 @ X5) | (X1 @ X2 @ X4 @ X5))))),
% 0.16/0.32 file('/export/starexec/sandbox/tmp/tmp.exKh5hQAAD/Vampire---4.8_7491',cTHM120G_pme)).
% 0.16/0.32 % SZS output end Proof for Vampire---4
% 0.16/0.32 % (7733)------------------------------
% 0.16/0.32 % (7733)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.32 % (7733)Termination reason: Refutation
% 0.16/0.32
% 0.16/0.32 % (7733)Memory used [KB]: 5500
% 0.16/0.32 % (7733)Time elapsed: 0.004 s
% 0.16/0.32 % (7733)Instructions burned: 3 (million)
% 0.16/0.32 % (7733)------------------------------
% 0.16/0.32 % (7733)------------------------------
% 0.16/0.32 % (7727)Success in time 0.001 s
% 0.16/0.32 % Vampire---4.8 exiting
%------------------------------------------------------------------------------